Collective List-only Entity Linking: A Graph-based Approach
نویسندگان
چکیده
List-only entity linking is the task of mapping ambiguous mentions in texts to target 8 entities in a group of entity lists. Different from traditional entity linking task, which leverages rich 9 semantic relatedness in knowledge bases to improve linking accuracy, list-only entity linking can 10 merely take advantage of co-occurrences information in entity lists. State-of-the-art work utilizes 11 co-occurrences information to enrich entity descriptions, which are further used to calculate local 12 compatibility between mentions and entities to determine results. Nonetheless, entity coherence is also 13 deemed to play an important part in entity linking, which is yet currently neglected. In this work, in 14 addition to local compatibility, we take into account global coherence among entities. Specifically, we 15 propose to harness co-occurrences in entity lists for mining both explicit and implicit entity relations. 16 The relations are then integrated into an entity graph, on which Personalized PageRank is incorporated 17 to compute entity coherence. The final results are derived by combining local mention-entity similarity 18 and global entity coherence. The experimental studies validate the superiority of our method. Our 19 proposal not only improves the performance of list-only entity linking, but also opens up the bridge 20 between list-only entity linking and conventional entity linking solutions. 21
منابع مشابه
An Optimal Approach to Local and Global Text Coherence Evaluation Combining Entity-based, Graph-based and Entropy-based Approaches
Text coherence evaluation becomes a vital and lovely task in Natural Language Processing subfields, such as text summarization, question answering, text generation and machine translation. Existing methods like entity-based and graph-based models are engaging with nouns and noun phrases change role in sequential sentences within short part of a text. They even have limitations in global coheren...
متن کاملEfficient Collective Entity Linking with Stacking
Entity disambiguation works by linking ambiguous mentions in text to their corresponding real-world entities in knowledge base. Recent collective disambiguation methods enforce coherence among contextual decisions at the cost of non-trivial inference processes. We propose a fast collective disambiguation approach based on stacking. First, we train a local predictor g0 with learning to rank as b...
متن کاملPair-Linking for Collective Entity Disambiguation: Two Could Be Better Than All
Collective entity disambiguation, or collective entity linking aims to jointly resolve multiple mentions by linking them to their associated entities in a knowledge base. Previous works largely based on the underlying assumption that entities within the same document are highly related. However, the extend to which these mentioned entities are actually connected in reality is rarely studied and...
متن کاملGraph Ranking for Collective Named Entity Disambiguation
Named Entity Disambiguation (NED) refers to the task of mapping different named entity mentions in running text to their correct interpretations in a specific knowledge base (KB). This paper presents a collective disambiguation approach using a graph model. All possible NE candidates are represented as nodes in the graph and associations between different candidates are represented by edges bet...
متن کاملAn Approach to Collective Entity Linking
Entity linking is the task of disambiguating entities in unstructured text by linking them to an entity in a catalog. Several collective entity linking approaches exist that attempt to collectively disambiguate all mentions in the text by leveraging both local mention-entity context and global entity-entity relatedness. However, the complexity of these models makes it unfeasible to employ exact...
متن کامل